ND-Tree: Multidimensional Indexing Structure
نویسنده
چکیده
The importance of multimedia databases has been growing over the last years in the most diverse areas of application, such as: Medicine, Geography, etc. With the growth of importance and of use, including the explosive increase of multimedia data on the Internet, comes the larger dimensions of these databases. This evolution creates the need for more efficient indexing structures in a way that databases can be useful, returning accurate results in a short time. Typically, these databases use multi-dimensional indexing structures to deal with feature vectors extracted from multimedia elements. However, the majority of existing multidimensional indexing structures, suffer from the well-known “dimensionality curse”, making the search in high-dimensional spaces a hard problem. In this work we developed an efficient indexing structure to support large databases containing data of high dimensions (over 100). The new indexing structure, *D-Tree (*orm Diagonal Tree), is based on a new dimension reduction technique based on two metric measures, Euclidean norm and distance to the unity cube diagonal. Experimental results show that our solution is more efficient and that the two metric measures provide a more effective pruning mechanism, while compared to other indexing structures.
منابع مشابه
The ND-Tree: A Dynamic Indexing Technique for Multidimensional Non-ordered Discrete Data Spaces
Similarity searches in multidimensional Nonordered Discrete Data Spaces (NDDS) are becoming increasingly important for application areas such as genome sequence databases. Existing indexing methods developed for multidimensional (ordered) Continuous Data Spaces (CDS) such as R-tree cannot be directly applied to an NDDS. This is because some essential geometric concepts/properties such as the mi...
متن کاملAn efficient peer-to-peer indexing tree structure for multidimensional data
As one of the most important technology for implementing large-scale distributed systems, peer-to-peer (P2P) computing has attracted much attention in both research and academia communities, for its advantages such as high availability, high performance, and high flexibility to the dynamics of networks. However, multidimensional data indexing remains as a big challenge to P2P computing, because...
متن کاملOptimised Kd-tree Indexing of Multimedia Data
Near neighbor searching in image databases is a multidimensional problem. The kd-tree is one of the first methods proposed for indexing multidimensional data. We describe optimizations of this method, and determine when they are appropriate. We discuss adaptations of the tree to feature extraction and indexing problems in multimedia data. Results show increased functionality and speed using the...
متن کاملBenchmarking the UB-tree
In the area of multidimensional databases, the UB-tree represents a promising indexing structure. A key feature of any multidimensional indexing structure is its ability to effectively perform the range queries. In the case of UB-trees, we have proposed an advanced range query algorithm making possible to operate on indices of high dimensionality. In this paper we present experimental results o...
متن کاملEfficient Integration of Structure Indexes of XML
Several indexing methods have been proposed to encode tree structures and path structures of XML, which are generally called structure indexes. To efficiently evaluate XML queries, it is indispensable to integrate tree structure and path structure indexes as a multidimensional index. Previous work of XML indexing have often developed specialized data structures tailored to some query patterns t...
متن کامل